Solving Timetabling problems using Genetic Algorithm Technique
نویسندگان
چکیده
The timetabling problem is always a difficult task which comes up every calendar year in educational institutions. More especially if it has to be done manually. Various institutions of learning across the country are being faced with a lot of difficulties preparing examination timetable. Most of this problems are usually attributed to the constant increase in the number of students and courses while having limited resources (exam classes) to use in scheduling. The aim of this paper is to propose the use of genetic algorithm technique to develop an easier, effective and efficient timetable using in order to ease the problems faced during scheduling of examination. Although, there are various scheduling techniques, but the use of Genetic Algorithm was based on the fact that, the algorithm are robust there by properly fits into complex problem space. The new method is aimed at providing a more flexible timetable representation and proved to be efficient in real life applications..
منابع مشابه
A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem
Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...
متن کاملHybrid artificial intelligence technique for solving large, highly constrained timetabling problems
Timetabling problems are often hard and time-consuming to solve. Profits from full automatization of this process can be invaluable. Although over the years many solutions have been proposed, most of the methods concern only one problem instance or class. This paper describes a possibly universal method for solving large, highly constrained timetabling problems from different areas. The solutio...
متن کاملA Study of Genetic Algorithms to Solve the School Timetabling Problem
This paper examines the use of genetic algorithms (GAs) to solve the school timetabling problem. The school timetabling problem falls into the category of NP-hard problems. Instances of this problem vary drastically from school to school and country to country. Previous work in this area has used genetic algorithms to solve a particular school timetabling problem and has not evaluated the perfo...
متن کاملA Standard Framework for Timetabling Problems
When timetabling experts are faced with a new timetabling problem, they usually develop a very specialised and optimised solution for this new underlying problem. One disadvantage of this strategy is that even slight changes of the problem description often cause a complete redesign of data structures and algorithms. Furthermore, other timetabling problems cannot be fit to the data structures p...
متن کاملA Guided Search Non-dominated Sorting Genetic Algorithm for the Multi-Objective University Course Timetabling Problem
The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previo...
متن کاملSolving Timetabling problems using Genetic Algorithm Technique
The timetabling problem is always a difficult task which comes up every calendar year in educational institutions. More especially if it has to be done manually. Various institutions of learning across the country are being faced with a lot of difficulties preparing examination timetable. Most of this problems are usually attributed to the constant increase in the number of students and courses...
متن کامل